Order-sorted feature theory unification

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Order-Sorted Feature Theory Unification

Order-sorted feature (OSF) terms provide an adequate representation for objects as flexible records. They are sorted, attributed, possibly nested, structures, ordered thanks to a subsort ordering. Sort definitions offer the functionality of classes imposing structural constraints on objects. These constraints involve variable sorting and equations among feature paths, including self-reference. ...

متن کامل

Order-sorted Equational Unification Revisited

This paper presents a rule-based algorithm for performing order-sorted E-unification using an unsorted E-unification decision procedure under assumptions about E that are commonly satisfied in practice. We have implemented this algorithm in Maude for use with the Maude-NRL protocol analyzer and have used CiME for unsorted E-unification for E any set of AC and ACU axioms. In many examples of int...

متن کامل

Order-Sorted Unification with Regular Expression Sorts

We extend first-order order-sorted unification by permitting regular expression sorts for variables and in the domains of function symbols. The set of basic sorts is finite. The corresponding unification problem is infinitary. We conjecture that this unification problem is decidable and give a complete unification procedure.

متن کامل

Regular expression order-sorted unification and matching

We extend order-sorted unification by permitting regular expression sorts for variables and in the domains of function symbols. The obtained signature corresponds to a finite bottom-up unranked tree automaton. We prove that regular expression order-sorted (REOS) unification is of type infinitary and decidable. The unification problem presented by us generalizes some known problems, such as, e.g...

متن کامل

Description Logic vs. Order-Sorted Feature Logic

We compare and contrast Description Logic (DL) and Order-Sorted Feature (OSF) Logic from the perspective of using them for expressing and reasoning with knowledge structures of the kind used for the Semantic Web. Introduction The advent of the Semantic Web has spurred a great deal of interest in various Knowldege Representation formalisms for expressing, and reasoning with, so-called formal ont...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Journal of Logic Programming

سال: 1997

ISSN: 0743-1066

DOI: 10.1016/s0743-1066(96)00053-2